PFORTE: Revising Probabilistic FOL Theories
نویسندگان
چکیده
منابع مشابه
Compact Propositional Encoding of First-Order Theories
In this paper we present polynomial-time algorithms that translate First-Order Logic (FOL) theories to smaller propositional encodings than achievable before in polynomial time. For example, we can sometimes reduce the number of propositions to O(|P | + |C|), or O(|P | · log |P |), for |P | predicates of arity k and |C| constant symbols. The guarantee depends on availability of some graphical s...
متن کاملDip. Di Matematica Applicata Ed Informatica Technical Report Series on Computer Science Composing Complete and Partial Knowledge Composing Complete and Partial Knowledge
The representation of knowledge in the logic OLP-FOL 8], 7], is split in two parts: writing deenitions for known concepts, and writing constraints, expressing partial knowledge on other concepts. This is reeected in an OLP-FOL theory T , which is a pair: T = (T d ; T c). The deenition part T d contains the deenitions for known predicates in the form of a normal open logic program (OLP), whereas...
متن کاملSuperposition modulo theory
This thesis is about the Hierarchic Superposition calculus SUP(T) and its application to reasoning in hierarchic combinations FOL(T) of the free first-order logic FOL with a background theory T where the hierarchic calculus is refutationally complete or serves as a decision procedure. Particular hierarchic combinations covered in the thesis are the combinations of FOL and linear and non-linear ...
متن کاملRevising Imprecise Probabilistic Beliefs in the Framework of Probabilistic Logic Programming
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base which contains a set of conditional events with probability intervals. In this paper, we investigate the issue of revising such a PLP in light of receiving new information. We propose postulates for revising PLPs when a n...
متن کاملCombination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reactive system while LTL specifies its (dynamic) behavior. In this paper, we derive undecidability and deci...
متن کامل